Performance measure sensitive congruences for Markovian process algebras

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Performance measure sensitive congruences for Markovian process algebras

The modeling and analysis experience with process algebras has shown the necessity of extending them with priority, probabilistic internal/external choice, and time while preserving compositionality. The purpose of this paper is to make a further step by introducing a way to express performance measures, in order to allow the modeler to capture the QoS metrics of interest. We show that the stan...

متن کامل

Probabilistic Branching in Markovian Process Algebras

We introduce immediate transitions as an extension of Stochastic Process Algebras (SPA). We distinguish two diierent classes of immediate transitions: probabilistic branching and management activities. We discuss both approaches and develop a theory for the probabilistic branching case. Although we use TIPP as a sample language within this paper, the theory can easily be adapted to other Stocha...

متن کامل

Congruences of convex algebras

We provide a full description of congruence relations of convex, positive convex, and totally convex algebras. As a consequence of this result we obtain that finitely generated convex (positive convex, totally convex) algebras are finitely presentable. Convex algebras, in particular positive convex algebras, are important in the area of probabilistic systems. They are the Eilenberg-Moore algebr...

متن کامل

Congruences of Concept Algebras

Concept algebras are concept lattices enriched with two unary operations, a weak negation and a weak opposition. In this contribution we provide a characterization of congruences of concept algebras. AMS Mathematics Subject Classification (2000): 06B10, 06B05, 03G25, 03G10

متن کامل

Complemented congruences on Ockham algebras

An Ockham algebra L = (L,∧,∨, f, 0, 1) that satisfies the identity f2n+m = fm, n ∈ N and m ∈ N0, is called a Kn,m-algebra. Generalizing some results obtained in [2], J. Varlet and T. Blyth, in [3, Chapter 8], study congruences on K1,1-algebras. In particular, they describe the complement (when it exists) of a principal congruence and characterize these congruences that are complemented. In this...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2003

ISSN: 0304-3975

DOI: 10.1016/s0304-3975(01)00090-1